Vertices Belonging to All or to No Minimum Locating Dominating Sets of Trees
نویسندگان
چکیده
A set D of vertices in a graph G is a locating-dominating set if for every two vertices u, v of G \ D the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. In this paper, we characterize vertices that are in all or in no minimum locating dominating sets in trees. The characterization guarantees that the γL-excellent tree can be recognized in a polynomial time.
منابع مشابه
Vertices belonging to all or to no minimum double dominating sets in trees
In a graph G = (V, E) , a vertex dominates itself and all its neighbors. A double dominating set of G is a dominating set that dominates every vertex of G at least twice. In this paper, we characterize vertices that are in all or in no minimum double dominating sets in trees.
متن کاملLocating and total dominating sets in trees
Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
متن کاملA sharp lower bound for locating-dominating sets in trees
Let LD(G) denote the minimum cardinality of a locating-dominating set for graph G. If T is a tree of order n with l leaf vertices and s support vertices, then a known lower bound of Blidia, Chellali, Maffray, Moncel and Semri [Australas. J. Combin. 39 (2007), 219–232] is LD(T ) ≥ (n+ 1 + l − s)/3 . In this paper, we show that LD(T ) ≥ (n+ 1 + 2(l − s))/3 and these bounds are sharp. We construct...
متن کاملNew results on metric-locating-dominating sets of graphs
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S, and the minimum cardinality of such a set is called the metric-locationdomination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: ...
متن کاملLocating-dominating sets in twin-free graphs
A locating-dominating set a of graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of u. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015